∂06-JUL-75  1351		ESS,JMC
 How are we doing with EPRI?
␈ CC: jh

∂06-JUL-75  0752		ESS,JMC
 I have returned from Japan.  What is the current ARPA contemplation
 of AI?
␈ CC: licklider%ISI

∂16-APR-75  1017		ESS,JMC
 Please see a message from Newell to me and my reply in outgo.msg[ess,jmc].
 Z
␈ CC: les;ccg;tw

∂16-APR-75  1016		ESS,JMC
 Incidentally, the first character of each line of yrs was lost.
␈ CC: newell%CMU-10B

∂16-APR-75  1002		ESS,JMC
 I agree with the content of your message.  I can't go into detail, because I'm
 returning to Japan in 10 minutes.  However,
 	1. Why don't we suggest a two weak AI applications study group
 in Washington this summer.  The first two in August would suit me, but
 there could be others from Stanford.
 	2. I agree that Heilmeier's suggestions are dubious, but I got
 an idea that maybe his attack on AI has run out of internal steam and
 all he wants now is some kind of symbolic redirection.  As you say, it is
 hard to imagine enlarging the Morse effort, and the language recognition
 is for the speech group, leaving ASW as the only possibility which might
 be hard to declassify.
 	3. We have decided to pursue the car-finder that I mentioned
 without further ado in the hopes of having a silver bullet in three
 months.  I don't know if you remember what I said about my meeting
 with Tactical technology in which they said they would be impressed by
 such a demo into thinking that scene analysis might have target finding
 applications.
 	4. I am a bit happier with the list of AI science topics that
 Russell put on the board than I am with the list in your memo, because in
 xx it includes the problems that interest me.  In general, if Russell gets
 his way, we don't have a qualitative problem we can't adjust to - only
 some budgetary problems.
 	5.  If someone had the time, the best use of it in the next week
 or so (sorry about weak earlier in the message) might be to put flesh on
 the list of scientific problems that Russell posted and to formulate
 a proposal for the summer study that a number of groups could agree to
 including how to sanitize classified info.
␈ CC: newell%CMU

∂15-APR-75  1711		ESS,JMC
 The syllabus is tolerable to me.  I suggest you include my review of the
 Lighthill report that appeared in the AI Journal, but this is not a strong
 suggestion.
␈ CC: dbl

∂12-APR-75  2018		ESS,JMC
 It will have to wait till I return.
␈ CC: bpm

∂27-MAR-75  0356		ESS,JMC
 When I send you my best mailing address and telephone number, do a PLAN
 command while logged in as ess,jmc.  Put in that I will be gone till
 approximately 30 June and my address and telephone number and that AI
 Laboratory matters should be referred to Les.
␈ CC: paw

∂26-MAR-75  2239		ESS,JMC
 print phon
␈ CC: jmc

∂26-MAR-75  2220		ESS,JMC
 Ginparg says he is working for Terry.  Please co-ordinate with each other
 on whether he is satisfactorily productive.
␈ CC: tw;les

∂26-MAR-75  0115		ESS,JMC
 I guess I have turned them in for those that bugged me about it, but
 there may be a few others.  Do you have a complete list?
␈ CC: nxl

∂26-MAR-75  0107		ESS,JMC
 What are you dng for us?  Please see me today if possible.
␈ CC: jj

∂26-MAR-75  0104		ESS,JMC
 Bill Reynolds asked me where you stand with Exxon and EPRI.  I would
 like to know also.  ease reply Wednesday as I am going to Japan on
 Thursday.
␈ CC: jh

∂26-MAR-75  0102		ESS,JMC
 Richard said you said you would do the interspersed commands and sentences in FOL.
 I think you should finish this, as you got of rather lightly in CS258 - no fault
 of your own, of course.  I have turned in grades and I am leaving for Japan
 for 3 months early Thursday am.
␈ CC: nxl

∂26-MAR-75  0100		ESS,JMC
 Please xgp my files with extension ess on [cur,jmc] (do this first)
 and [ess,jmc].  Those which ar pox files should be poxed.
␈ CC: paw

∂25-MAR-75  2253		ESS,JMC
 Please put LES@SU-AI in my place on mailing lists, because I am leaving
 for Japan on Thursday until about June 30.
␈ CC: WEINER%RAND-RCC

∂25-MAR-75  0057		ESS,JMC
 My Imlac is working again, and the fan seems to have temporarily recovered.
␈ CC: tag;ted

∂22-MAR-75  0315		ESS,JMC
 Hasn't the terminal in the CS Library been out of order for months,
 and if so, why?
␈ CC: TAG

∂20-MAR-75  2055		ESS,JMC
 I think you said that Margaret wrote a review of a book by Lilly starting,
 "This crackpot book ...".  If so please send me a copy, because it shoud
 be worth reading.
␈ CC: minsky%AI

∂20-MAR-75  1928		ESS,JMC AT TTY72   1928
 job 31 user sys has lpt and has been inactive for 40 min
␈ CC: rcp

∂19-MAR-75  1529		ESS,JMC
 3 to 6 months, more with good reason.
␈ CC: pdq

∂19-MAR-75  1239		ESS,JMC
 Please see me about SENSE when you have time.
␈ CC: rht

∂18-MAR-75  1247		ESS,JMC
 Here is the form of Ramsey's theorem Juan Bulnes should try to prove.
 
 Consider a countable infinity of vertices, each vertex being connected
 to every other by a thread, each thread being red or black.  Prove that
 there is an infinite subset of these vertices, such that the connecting
 threads within the subset are all of the same color.
 
 Proof: Choose a vertex v1.  Either v1 is connected to ∞ vertices by
 red threads or not.  If yes, consider from now on only the vertices
 connected to v1 by red threads, and try for a vertex v2 connected to
 ∞ by red threads.  If you get it try for v3, etc.  Either this construction
 can be continued indefinitely, in which case it constructs the desired
 set, or not.  If not, we have an infinite subset A of the vertices within
 which each vertex is connected to only a finite number by red threads.
 In that case, we can build the desired set as follows: suppose we have
 a finite set  B(n) all connected by black threads.  Since each vertex of this
 set is connected to only a finite number of vertices by red threads and
 there are ∞ vertices in A, we can find a vertex to adjoin to B(n) that is
 connected to all the members of B(n) by black threads,
 thus giving B(n+1).  Continuing this
 construction indefinitely proves the theorem.
 
 It is this proof that should be formalized.
␈ CC: jb;rww;bg

∂17-MAR-75  2341		ESS,JMC
 I just haven't time, although I am flattered.
␈ CC: tob

∂16-MAR-75  1757		ESS,JMC
 Yes, but keep co-ordinated with Forest.
␈ CC: reg

∂15-MAR-75  2047		ESS,JMC
 On Monday night at 8pm at the home of Prof. Tom Connolly, 855 Lathrop,
 Prof. Hans Bethe of Cornell, who is visiting SLAC for a few weeks will
 talk about the politics of nuclear energy.  He is worried that the anti-
 nuclear lobby will kill or cripple nuclear energy which is necessary
 to keep the country going.  We will discuss what might be done to head
 off the anti-nuclear initiative in California.
␈ CC: boyer%SRI-AI

∂15-MAR-75  1800		ESS,JMC
 Long technical initial messages are discouraging to the NS user.
 Future messages should be limited to one line and give a reference.
␈ CC: me

∂14-MAR-75  2256		ESS,JMC
 I just got home, and SOL looks promising, but I haven't been to the Lab
 to print a copy.  I suppose I could understand it as is, but a statement
 of how your production systems are interpreted would help.  My guess is that
 now the solitaire thing more or less works, it would justify a considerable
 effort to clarify exactly what the productions are, and how they are interpreted.
 Also everything should be put into the most elegant form and any awkwardnesses
 eliminated or identified as still unresolved problems in the notion of
 production system.  When you have it in good enough shape, it might be
 interesting to get Newell's comments.
 
 I think I will be able to read it in some detail this weekend, and in any case
 I will talk with you Monday or Tuesday afternoon, or even this weekend if
 we happen to co-incide.
␈ CC: dew

∂07-MAR-75  2135		ESS,JMC
 Please call Peninsula Mazda (redwood city) on Monday and make an appointment
 for 36,000 mile servicing for the following Monday or as soon as possible
 thereafter.
␈ CC: paw

∂07-MAR-75  2010		ESS,JMC
 Please phone me right away, because I can't find the SX-70.
␈ CC: sgk

∂07-MAR-75  2002		ESS,JMC
 Please feed Caspian.  Sarah will be back Wednesday night.  Caspian should be let
 in and out in an irregular schedule but with sufficient frequency.
␈ CC: sgk

∂07-MAR-75  1944		ESS,JMC
 I should be able to lend you the money when I return from Drake's Anchorage.
 I think that while I am away, you shouldn't pay board but only rent, because
 I needn't be involved in whatever arrangements you make with Whit and Mary
 and Sarah, if any.
␈ CC: sgk

∂07-MAR-75  1904		ESS,JMC
 Dear Lick:
 
 	I think  the new version  of the proposal  will be  very much
 better containing an executive summary and meeting your criticisms in
 its separate sections.  Versions  of the sections have been  prepared
 but the executive  summary has still not been written.   It is partly
 because  I had  to long committed  speeches to  make in  the last two
 weeks, but  also  because it  took me  a  long time  to  get my  head
 straight about why ARPA should  support AI and what form this support
 should take.   Besides the proposal  itself, there will  be a  rather
 long cover  letter addressing some  of your points  explicitly rather
 than implicitly as in the proposal itself. 
 
 	The  main problems that will  be addressed are  the degree of
 goal  scheduling  asked   for,  the   concentration  of   immediately
 producible applications,  and the  requirement to  fit in  with plans
 produced  by the IPT committee  structure.  In  some respects, we can
 meet these conditions, but in other respects they  will be disastrous
 both for us and for what DoD should get out of the research. 
 
 	Let me  try one argument  on you now,  however.  Part  of the
 research results to be obtained in AI  can be planned for, but AI  is
 one of those  branches of science in  which some of the  progress may
 come in sudden  breakthroughs.  Moreover, such breakthroughs may have
 immense practical consequences,  i.e. if it  led to  an RPV with  the
 ability to  do human quality  tactical thought at  electronic speeds.
 This being  the case, ARPA has bought insurance by its support of AI.
 Namely, it has insured a better than 90% probability  that had such a
 breakthrough occurred, it would have happened in the United States in
 a lab supported by ARPA.  One  thing it can get is a continuation  of
 this  insurance.    Let  me  remind  you  that  nuclear  fission  was
 discovered  in  Germany in  1939.    It was  great  fortune  that the
 discoverers, who realized the  significance of their discovery,  were
 motivated to  escape from Germany, and  it is a further  good fortune
 that  the discovery was followed  up in the United  States and not in
 Germany.   Indeed, all through  World War  II, the Manhattan  Project
 people thought they were racing with a corresponding German project. 
 Fortunately, the  world situation  is not  as tense  as it  was  just
 before World  War II,  but AI  has the  same potential  for a  sudden
 conceptual   breakthrough  that  would  lead   to  results  of  great
 importance.  The optimal  strategy for optimizing the  probability of
 such a breakthrough is not quite the same as optimizing the detail of
 a research plan or the probability of bullets in the next year. 
 
 	The  above is  not a plea  for unconditional  support with no
 proposal, and I think your criticisms will help make  a research plan
 that will increase the probability of a major breakthrough as well as
 increasing the number  of definite accomplishments,  but I think  the
 insurance argument is an important reason why  DoD should support AI,
 maybe the strongest reason. 
 
 	Now  an  additional  complication.   Because  of  yet another
 months' old commitment, I  can't get to the Principal  Investigator's
 meeting until Thursday morning.  This  will be the first one of which
 I have missed any part.  Therefore, I am asking Les Earnest to attend
 the first  day in my  place.  I  think this  will be optimal  anyway,
 because he will be running  the Laboratory in the Spring, and because
 I think  that  it  will make  it  much  easier for  us  to  mesh  our
 activities with IPT's  grand plans.  IF  THIS IS NOT OK,  THEN PLEASE
 SEND A MESSAGE TO LES@SU-AI, because I will be out of town. 
 
 	On the budget,  we would like to submit a better proposal for
 the same money and period as before.  After you have seen it,  we can
 rapidly cut it if this proves necessary, i.e. in a day. 
 
 				Best Regards,
 
 				John McCarthy
␈ CC: licklider%ISI

∂06-MAR-75  2345		ESS,JMC
 Most probably we can offer you half time support during the summer, i.e.
 at the same rate as during the year.  Moreover, I am not sure you should
 leave at the end of the summer, as I have some ideas concerning your thesis
 which might lead to an outcome more satisfactory both to you and to the
 committee.
␈ CC: AJT

∂04-MAR-75  1911		ESS,JMC
 I fixed it and poxed it and it is foo.xgp[cur,jmc], but I left it for you to spool.
␈ CC: paw

∂04-MAR-75  1434		ESS,JMC
 Can you send me a copy of your notes on Semantics of Programming Languages.
 It would be most useful if I could get it early next week.
␈ CC: VRP%AI

∂03-MAR-75  1358		ESS,JMC
 03-11	Tax man 11am March 17
␈ CC: :CALEND.

∂03-MAR-75  1346		ESS,JMC
 I haven't read many papers recently and have no vote on
 "Computers and Thought" lecturer.
␈ CC: phw%AI

∂02-MAR-75  2331		ESS,JMC
 Haven't we mispriced the additional displays.  I think it should definitely
 include some kind of PDP-11.
␈ CC: les

∂02-MAR-75  2323		ESS,JMC
 Well, I read lisp.pro.  Are you interested in proposing a sequence of
 fixed price contracts starting with something small and definite so
 that you and we can see how satisfactorily things are going.  I suggest
 you set a price that will pay you about 50% more than your last salary
 if you finish it in the time you estimate and have to do about 30% again
 in rework to satisfy us. Thus if you estimate that the job will take
 one month, you should bid 1.3*1.5 = 1.95 months' salary.  Settle with
 Weyhrauch what would be a suitable job, but I guess I prefer one of the
 documentation tasks first.
␈ CC: wd

∂02-MAR-75  2024		ESS,JMC
 Sticky switches are for the birds.
␈ CC: bh

∂02-MAR-75  1811		ESS,JMC
 We must finish proposal by Wednesday.
␈ CC: dcl

∂02-MAR-75  1757		ESS,JMC AT TTY15   1757
 Please phone.
␈ CC: les

∂02-MAR-75  1740		ESS,JMC
 Before pursuing issue of delegate safety, Marinov, or whoever is concerned
 should check with the U.S. State Department.  My impression that there has
 been no trouble of the kind Vesko fears (simply because I think cases of
 this kind would have gotten into the news sources I follow) can be confirmed
 by the State Department which is responsible for the safety of Americans
 travelling abroad includ∨ng resident non-citizens.
␈ CC: boyer%SRI-AI;erik%MIT-AI;sigart%CMU-10B

∂01-MAR-75  2231		ESS,JMC
 Please call Japanese consulate in San Francisco about my visa.  I need a
 visa that allows me to be paid, and I think the letter of invitation
 from the President of Kyoto University is sufficient documentation to
 get it.
␈ CC: paw

∂01-MAR-75  1650		ESS,JMC
 What have you done with your section of the proposal.
␈ CC: dcl

∂01-MAR-75  1617		ESS,JMC
 Income taand selling stock.
␈ CC: :TASK.

∂28-FEB-75  1447		ESS,JMC
 That is jmc.bio[cur,jmc].
␈ CC: paw

∂28-FEB-75  0521		ESS,JMC
 Yes, I can come to your committee meeting, but remind me.
␈ CC: ajt

∂28-FEB-75  0517		ESS,JMC
 I will be unable to come to the image understanding meeting next week, but
 I would like Tom Binford and Lynn Quam to go instead.  I have long been
 committed to a Sigma Xi lecture that conflicts, and I am going to be on
 sabbatical in Japan during the Spring quarter.  I hope that is ok.
 				John Mc
 xx
 John McCarthy
␈ CC: carlstrom%ISI

∂28-FEB-75  0511		ESS,JMC
 The class is in 111 Polya.
␈ CC: dcl

∂27-FEB-75  0010		ESS,JMC
 You forgot you had agreed to lecture in my class Tuesday.  How about lecturing
 March 11 and 13 when I have to be away?
␈ CC: dcl

∂25-FEB-75  0231		ESS,JMC
 I am still unhappy about the insufficient computer science content of
 the NEWS75[CUR,JMC] proposal.  However, we are in a big hurry, so please
 look again at the section entitled COMPUTER SCIENCE RESEARCH and make
 suggestions for improvement.
␈ CC: jh;me

∂25-FEB-75  0138		ESS,JMC
 Please order for me "Design of Man-Computer Dialogues" by Martin,Prentice-Hall.
␈ CC: PAW

∂24-FEB-75  1357		ESS,JMC
 Joe Goguin for ai diinner.
␈ CC: paw

∂24-FEB-75  1316		ESS,JMC
 Ron Kaplan makes reservation for AI dinner.
␈ CC: paw

∂24-FEB-75  0411		ESS,JMC
 An additional issue: Your comments on our proposal said that if we want outside
 TENEX time, we should expect to pay for it out of our budget.  Cordell wants
 a lot of it until the KL-10 is available and our system allows INTERLISP which
 he likes.  At present, he is cadging night time mostly from SRI, I think.
 At present many ARPA TENEX sites are hardly used at night.  Should we try to
 make our own deal or will ARPA help us determine what the price will be.  I
 don't now know how much I would be willing to budget, but I know I won't buy
 him a day shift PDP-10.  Is there someone else in IPT to talk to about this?
␈ CC: licklider%ISI

∂24-FEB-75  0343		ESS,JMC
 How do you think the following would work?  A mode of output in which the
 user program gives the system a character at a time, but the system can delay
 putting it on the user's screen until either a buffer is full or the user
 gives a display-it-now uuo.  The idea is that the user doesn't have to keep
 a buffer, and πhe system has to keep one anyway.  This would be good for
 generated rather than constant output from LISP and other programs.
 Consider it both in the context of the present system and a new one.
␈ CC: reg

∂23-FEB-75  0004		ESS,JMC
 Fixed.
␈ CC: JFR

∂22-FEB-75  2316		ESS,JMC
 CALL KAI WANG!!!!!
␈ CC: WD

∂22-FEB-75  1951		ESS,JMC
 Patte came in and made the first batch of changes.  I have started to
 think about changes and have decided to have separate sections on
 computer science research and behavioral research.  news75.mod[cur,jmc]
 is a start on the computer science research section.
␈ CC: me

∂22-FEB-75  1723		ESS,JMC
 The proposal is news75.pro[cur,jmc].
␈ CC: me

∂21-FEB-75  1820		ESS,JMC
 It looks like I have to go to Houston on Tuesday and be gone Wednesday,
 so I will have to reschedule.
␈ CC: bpm

∂21-FEB-75  1818		ESS,JMC
 Well, I thought it was supposed to be last week, but anyway I didn't do
 anything, and I guess I had better come back to the Lab and work after
 dinner, so let me postpone it.
␈ CC: boyer%SRI-AI

∂20-FEB-75  1855		ESS,JMC
 Your comments on our proposal are much appreciated and are giving us
 furiously to think.  I will have a message with a preliminary plan
 for meeting your requirements shortly and we will have a new draft
 in a couple weeks.  One substantive remark only because it may affect
 the second part of your remarks (if your energy persists).  While
 the KL-10 constitutes a major re-equipment, the cost to ARPA in the
 budget for this is rather small.  We believe that our plan is the
 most economical form of re-equipment.
␈ CC: licklider%ISI

∂20-FEB-75  1812		ESS,JMC
 brooks
␈ CC: Newell%CMU-10A

∂20-FEB-75  1742		ESS,JMC
 moran
 farley
 newell-control structures
 newell-stimulus encoding
 psnlst
 
 In general, examples of productions.
␈ CC: newell%CMU-10A

∂20-FEB-75  1633		ESS,JMC
 Send Floyd copy of Licklider comments that is on your desk.
␈ CC: paw

∂18-FEB-75  2253		ESS,JMC
 Please move meeting tomorrow because of Newell lecture at 3:30.
␈ CC: les

∂16-FEB-75  2355		ESS,JMC
 There is an error in VERIFY.TXT[EXP,TJW]; namely  9th line from bottom page 1 should be
   IF ↑CLOCK∧(S0∨S1) THEN Q[I] ← etc..
 As you have it, the register would be cleared when both S0 and S1 were low.  I am
 doubtful whether your Algol sufficiently describes the circuit to permit the
 verification of larger circuits of which it is a part.  In particular, it doesn't
 express the timing relationships that have to hold in order to get well defined
 results, e.g. the fact that S0 and S1 can change only when CLOCK is high.  I also
 have a somewhat vaguer worry that it doesn't say when the Algol statement is
 executed.  Apparently the clear can occur at any time and the other part only
 when the clock rises, and while this is hinted at by your Algol, I am not sure
 it permits the incorporation of this program into a larger Algol pr;gram
 without ambiguity.  Nevertheless, I agree with the approach.
␈ CC: TJW

∂16-FEB-75  1658		ESS,JMC
 I wonder if the program that receives the news could do an occasional garbage
 detection, and when it detects garbage complain to TED and TAG.
␈ CC: me

∂16-FEB-75  0325		ESS,JMC
 I have read your note on blobs.  Your notion of what can be done in predicate
 calculus is too limited.  Your argument is correct if the functions in the program
 are taken as functions in the logic and if we don't use axiom schemata.  Then,
 as I remarked in class in connection with Manna's method (after you gave
 me the note), a program can be shown to terminate only if it terminates in
 a number of steps independent of the parameters.  Your argument is a similar
 application of Henkin's theorem.  However, if we admit a suitable axiom schema,
 such things can be proved.  In your case the axiom schema would be
 (∀x.¬p(x)⊃Q(x))∧(∀x.p(x)∧Q(x)⊃Q(f(x))) ⊃ ∀x.Q(x).  In your trivial case, assuming
 the axiom schema is very close to assuming what fs to be proved, but
 it can also prove lots of other things about functions defined by the
 same basic recursion scheme involving  p  and  f.  Note: what I just said isn't
 quite right, because you want to allow for the fact that the recursion
 doesn't always terminate, in which case you need another predicate that
 will suitably relativize the formulas to the cases in which they do
 terminate.
 
 	However, as we shall see, one can do much better than that by making
 the functions defined recursively individuals in the logic rather than
 functions.  It is conceptually simplest to regard them as subsets of a
 product space, i.e. to represent them by their graphs, but this may not
 be most convenient practically.  If we do this, we can get by entirely with
 axioms and need know schemas even though this is again not necessarily the
 most convenient way to do it.  (The most convenient set theory is the
 Zermelo-Frankel which has an axiom schema, but the Godel-Bernays set theory
 which has no schemata is just as powerful as is shown in Cohen's book.)
 
 	Many of these matters will be treated in class, but I will be glad
 to tell you about them separately if you like.  Your proof is not incorrect;
 it merely shows the need for stronger formalisms than you imagined, and
 there is still a red herring involving non-standard models.
␈ CC: rae

∂16-FEB-75  0038		ESS,JMC
 No, but Monday would be nice.
␈ CC: nxl

∂16-FEB-75  0035		ESS,JMC
 What is present state of "r imsss"?
␈ CC: jbr

∂16-FEB-75  0032		ESS,JMC
 I have been too busy to extract any work from you on the LISP course notes.  You
 could help me by making up one complete copy of everything we have gotten out
 so far including exams and exercises.
␈ CC: nxl

∂16-FEB-75  0028		ESS,JMC
 I have read your chapter 7, and it seems to me that you must keep your mind
 in two completely separated compartments.  There is absolutely no suggestion
 in the chapter that you have ever heard of computers or information processing
 models - just old-fashioned philosophy.
 I have marked up the copy you gave me and will go over it with you.  I am
 shocked!!
␈ CC: ajt

∂15-FEB-75  2053		ESS,JMC
 I have several comments:
 
 	1. As I already mentioned, conditional expressions are ok.
 	2. More than half your existential quantifiers go away if you
 use the function LOC(P,B) for the location of piece P on board B, and
 your formulas simplify considerably.  In general, wherever there is a
 unique Y satisfying P(X,Y), it is better to use a function.  Allowing
 functions and equality is a common form of first order logic - not
 strictly predicate calculus - and FOL allows them.
 	3. You should rewrite your patterns with this extension, but,
 as I said before, not everything will be doable with patterns.  In
 particular, it doesn't seem to me that functions like occupiability
 are computed solely by pattern recognition.  It is a large part of your
 problem to determine what role patterns ought to play.
␈ CC: DEW

∂14-FEB-75  1910		ESS,JMC
 ACCEPT JAPANESE INVITATION.
␈ CC: :TASK.

∂14-FEB-75  1653		ESS,JMC
 Meeting with Tymshare 12:30 Tues,Tokaj Rest.,Menlo Park, RSVP.
␈ CC: FXB;CCG;TW

∂13-FEB-75  0123		ESS,JMC
 Thanks for FLAT proof.  I have started on first version and welcome second.
 We'll talk.
␈ CC: DBX

∂12-FEB-75  1620		ESS,JMC
 For Ed Frank:
 	Please telephone me 321-7580 in evening or 497-4430 afternoon.
 We can use a lot of help with further publicity of home terminal club.
␈ CC: nbs%ISIA

∂12-FEB-75  1451		ESS,JMC
 Tymshare tentatively 12:45pm Tuesday.
␈ CC: :CALEND.

∂12-FEB-75  1448		ESS,JMC
 lunch at Tymshare 12:45pm Tuesday.
␈ CC: :CALEND.TENTAT

∂12-FEB-75  1446		ESS,JMC
 baz
␈ CC: :FOO.;jmc

∂12-FEB-75  1444		ESS,JMC
 foo
␈ CC: :FOO.;jmc

∂12-FEB-75  1432		ESS,JMC
 Tentatively lunch at Tymshare 12:45pm Tuesday.
␈ CC: :CALEND;fxb;ccg;tw

∂11-FEB-75  1604		ESS,JMC
 Lucie Adam
 Story development editor, Fortune
 Time Life building
 Rockefeller Center
 New York 10020
 
 4pm Tuesday 25th,(212)556-3708
 Please send her a copy of the home terminal paper and
 put the meetin in CALEND.
␈ CC: paw

∂11-FEB-75  1022		ESS,JMC
 I received a fragment of a message from you.  Please retransmit it.
␈ CC: nbs%ISIA

∂11-FEB-75  1020		ESS,JMC
 Would you be willing to talk in my MTC class about the Hoare axioms and
 related matters?
␈ CC: dcl

∂11-FEB-75  0337		ESS,JMC
 Please make faculty club reservation for me for 12:30 today.
␈ CC: paw

∂11-FEB-75  0009		ESS,JMC
 It involves looking a gift horse in the mouth.
␈ CC: fxb

∂08-FEB-75  1535		ESS,JMC
 Schroeppel & Co. welcome.
␈ CC: SGK

∂07-FEB-75  1317		ESS,JMC
 SEE BURCHF.TMP[ESS,JMC]
␈ CC: PAW

∂05-FEB-75  0537		ESS,JMC AT TTY15   0537
 What is the current state of interest in NS?  You can reply by
 SEND JMC <carriage return> followed by the message followed by <ctrl z>.
␈ CC: JI

∂05-FEB-75  0106		ESS,JMC
 Find out whom I have to inform and how that Morales and Bulnes passed
 the MTC qual.
␈ CC: paw

∂03-FEB-75  1351		ESS,JMC
 Catch me sometime, and I'll tell you what I know.
␈ CC: ajt

∂03-FEB-75  0023		ESS,JMC
 Please decorate reynol.le3.
␈ CC: paw

∂02-FEB-75  2215		ESS,JMC
 I expect to be in Monday afternoon, but may go to energy seminar at 4:15.
 Before that would be best.
␈ CC: pmk

∂02-FEB-75  2215		ESS,JMC
 I expect to be in Monday afternoon but may go to energy seminar
␈ CC: pmk